Protein structural similarity search by Ramachandran codes
نویسندگان
چکیده
منابع مشابه
Inner Product Similarity Search using Compositional Codes
This paper addresses the nearest neighbor search problem under inner product similarity and introduces a compact code-based approach. The idea is to approximate a vector using the composition of several elements selected from a source dictionary and to represent this vector by a short code composed of the indices of the selected elements. The inner product between a query vector and a database ...
متن کاملProtein complex compositions predicted by structural similarity
Proteins function through interactions with other molecules. Thus, the network of physical interactions among proteins is of great interest to both experimental and computational biologists. Here we present structure-based predictions of 3387 binary and 1234 higher order protein complexes in Saccharomyces cerevisiae involving 924 and 195 proteins, respectively. To generate candidate complexes, ...
متن کاملDocking by structural similarity at protein-protein interfaces.
Rapid accumulation of experimental data on protein-protein complexes drives the paradigm shift in protein docking from "traditional," template free approaches to template based techniques. Homology docking algorithms based on sequence similarity between target and template complexes can account for up to 20% of known protein-protein interactions. When highly homologous templates for the target ...
متن کاملSearch for structural similarity in proteins
MOTIVATION The expanding protein sequence and structure databases await methods allowing rapid similarity search. Geometric parameters-dihedral angle between two sequential peptide bond planes (V) and radius of curvature (R) as they appear in pentapeptide fragments in polypeptide chains-are proposed for use in evaluating structural similarity in proteins (VeaR). The parabolic (empirical) functi...
متن کاملAngular Quantization-based Binary Codes for Fast Similarity Search
This paper focuses on the problem of learning binary codes for efficient retrieval of high-dimensional non-negative data that arises in vision and text applications where counts or frequencies are used as features. The similarity of such feature vectors is commonly measured using the cosine of the angle between them. In this work, we introduce a novel angular quantization-based binary coding (A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2007
ISSN: 1471-2105
DOI: 10.1186/1471-2105-8-307